Speed Up Image Annotation Based on LVQ Technique with Affinity Propagation Algorithm.

Web 2.0 traffic measurement analysis on online map applications.

Digital multisignature on the generalized conic curve over Zn.

Region Sampling Continuous Adaptive Sampling on Sensor Networks.
Abstract — Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer error bounding solutions for aggregate approximation but cannot guarantee energy spending. Inversely, our goal is to bound the energy consumption while minimizing the approximation error. In this paper, we propose an online algorithm, Region Sampling, for computing approximate aggregates while satisfying a pre-defined energy budget. Our algorithm is distinguished by segmenting a sensor network into partitions of non-overlapping regions and performing sampling and local aggregation for each region. The sampling energy cost rate and sampling statistics are collected and analyzed to predict the optimal sampling plan. Comprehensive experiments on real-world data sets indicate that our approach is at a minimum of 10 % more accurate compared with the previously proposed solutions. I.
Region Sampling Continuous Adaptive Sampling on Sensor Networks.
Abstract — Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer error bounding solutions for aggregate approximation but cannot guarantee energy spending. Inversely, our goal is to bound the energy consumption while minimizing the approximation error. In this paper, we propose an online algorithm, Region Sampling, for computing approximate aggregates while satisfying a pre-defined energy budget. Our algorithm is distinguished by segmenting a sensor network into partitions of non-overlapping regions and performing sampling and local aggregation for each region. The sampling energy cost rate and sampling statistics are collected and analyzed to predict the optimal sampling plan. Comprehensive experiments on real-world data sets indicate that our approach is at a minimum of 10 % more accurate compared with the previously proposed solutions. I.
Real%2DTime Querying of Historical Data in Flash%2DEquipped Sensor Devices.

A Digital Signature Scheme on the Conic Curve over Zn Based on Two Hard Problems.

Top%2Dk Retrieval Techniques in Distributed Sensor Systems.

Efficient Data Sampling in Heterogeneous Peer%2Dto%2DPeer Networks.

Analysis and case study on multi%2Ddimensional scalability of the Internet architecture.

Efficient Data Sampling in Heterogeneous Peer%2Dto%2DPeer Networks.

Reliable Hierarchical Data Storage in Sensor Networks.

Distributed spatio%2Dtemporal similarity search.
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to Q, when each of the target trajectories is segmented across a number of distributed nodes. We propose two novel algorithms, UB-K and UBLB-K, which combine local computations of lower and upper bounds on the matching between the distributed subsequences and Q. Such an operation generates the desired result without pulling together all the distributed subsequences over the fundamentally expensive communication medium. Our solutions find applications in a wide array of domains, such as cellular networks, wildlife monitoring and video surveillance. Our experimental evaluation using realistic data demonstrates that our framework is both e#cient and robust to a variety of conditions.
An outlier%2Dbased data association method for linking criminal incidents.
Data association is an important data-mining task and it has various applications. In crime analysis, data association means to link criminal incidents committed by the same person. It helps to discover crime patterns and catch the criminal. In this paper, we present an outlier-based data association method. An outlier score function is defined to measure the extremeness of an observation, and the data association method is developed based upon the outlier score function. We apply this method to the robbery data from Richmond, Virginia, and compare the result with a similarity-based association method. Result shows that the outlier-based data association method is promising.
Efficient information compression in sensor networks.

Efficient indexing data structures for flash%2Dbased sensor devices.
this article we present two external memory index structures for the e#cient retrieval of records stored on the local flash memory of a WSD. Our index structures, MicroHash and MicroGF (Micro Grid Files), exploit the asymmetric read/write and wear characteristics of flash memory in order to o#er high performance indexing and searching capabilities in the presence of a low energy budget, which is typical for the devices under discussion. Both structures organize data and index pages on the flash media using a sorted by timestamp file organization. A key idea behind these index structures is that expensive random access deletions are completely eliminated. MicroHash enables equality searches by value in constant time and equality searches by timestamp in logarithmic time at a small cost of storing the index pages on the flash media. Similarly, MicroGF enables spatial equality and proximity searches in constant time. We have implemented these index structures in nesC, the programming language of the TinyOS operating system. Our trace-driven experimentation with several real datasets reveals that our index structures o#er excellent search performance at a small cost of constructing and maintaining the index
Applying LVQ Techniques to Compress Historical Information in Sensor Networks.

MicroHash An Efficient Index Structure for Flash%2DBased Sensor Devices.
In this paper we propose the MicroHash index, which is an efficient external memory structure for Wireless Sensor Devices (WSDs). The most prevalent storage medium for WSDs is flash memory. Our index structure exploits the asymmetric read/write and wear characteristics of flash memory in order to offer high performance indexing and searching capabilities in the presence of a low energy budget which is typical for the devices under discussion. A key idea behind MicroHash is to eliminate expensive random access deletions. We have implemented MicroHash in nesC, the programming language of the TinyOS [7] operating system. Our trace-driven experimentation with several real datasets reveals that our index structure offers excellent search performance at a small cost of constructing and maintaining the index. 1
A Data Compression Technique for Sensor Networks with Dynamic Bandwidth Allocation.

Criminal Incident Data Association Using the OLAP Technology.

An interactive neural network%2Dbased approach for solving multiple criteria decision%2Dmaking problems.

